Minimum-Cost Subgraphs for Joint Distributed Source and Network Coding
نویسندگان
چکیده
We consider multicast of correlated sources over a network. Assuming the use of random network coding, we provide a linear optimization formulation for allocation of link rates in the network, also known as subgraph construction. Such an approach requires joint distributed source and network coding, which often has a lower cost than of that required by separated source and network coding. We support this result with simulations on randomly generated networks and on network data collected from a Future Combat Systems (FCS) exercise at Lakehurst, NJ.
منابع مشابه
Minimum Communication Cost for Joint Distributed Source Coding and Dispersive Information Routing
This paper considers the problem of minimum cost communication of correlated sources over a network with multiple sinks, which consists of distributed source coding followed by routing. We introduce a new routing paradigm called dispersive information routing, wherein the intermediate nodes are allowed to ‘split’ a packet and forward subsets of the received bits on each of the forward paths. Th...
متن کاملMinimum cost mirror sites using network coding: Replication vs. coding at the source nodes
Content distribution over networks is often achieved by using mirror sites that hold copies of files or portions thereof to avoid congestion and delay issues arising from excessive demands to a single location. Accordingly, there are distributed storage solutions that divide the file into pieces and place copies of the pieces (replication) or coded versions of the pieces (coding) at multiple so...
متن کاملNetwork Coding with a Cost Criterion
We consider applying network coding in settings where there is a cost associated with network use. We show that, while minimum-cost multicast problems without network coding are very difficult except in the special cases of unicast and broadcast, finding minimum-cost subgraphs for single multicast connections with network coding can be posed as a linear optimization problem. In particular, we a...
متن کاملHybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملOn Large Scale Distributed Compression and Dispersive Information Routing for Networks
This paper considers the problem of distributed source coding for a large network. A major obstacle that poses an existential threat to practical deployment of conventional approaches to distributed coding is the exponential growth of the decoder complexity with the number of sources and the encoding rates. This growth in complexity renders many traditional approaches impractical even for moder...
متن کامل